An optimised homomorphic CRT-RSA algorithm for secure and efficient communication

نویسندگان

چکیده

Abstract Secure and reliable exchange of information between devices is crucial for any network in the current digital world. This maintained on storage devices, routing communication over cloud. Cryptographic techniques are used to ensure secure transmission data, ensuring user’s privacy by storing transmitting data a particular format. Using encryption, only intended user possessing key can access information. During or essential transmission, channel should be secured using robust encryption techniques. Homomorphic Encryption (HE) have been past this purpose. However, one flaws conventional HE seen either its slow fast decryption. Thus, paper proposes an optimized Chinese Remainder Theorem with Rivest-Shamir-Adleman (HE-CRT-RSA) algorithm overcome challenge. The proposed Technique, HE-CRT-RSA, utilizes multiple keys efficient security. In addition, performance HE-CRT-RSA was evaluated comparison classical RSA algorithm. result shows improvement reduced decryption time. It observed that 3–4% faster than (RSA). also suggests effectively enhances security issues cloud helps decrease involvement intruders third party during inside data/server centers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered

At CCS 2003, a new CRT-RSA algorithm was presented in [BOS03], which was claimed to be secure against fault attacks for various fault models. At CCS 2004, David Wagner presented an attack on the proposed scheme, claiming that the so-called BOS scheme was insecure for all presented fault models [Wag04]. However, the attack itself contains a flaw which shows that although the BOS scheme is broken...

متن کامل

CRT RSA Algorithm Protected Against Fault Attacks

Embedded devices performing RSA signatures are subject to Fault Attacks, particularly when the Chinese Remainder Theorem is used. In most cases, the modular exponentiation and the Garner recombination algorithms are targeted. To thwart Fault Attacks, we propose a new generic method of computing modular exponentiation and we prove its security in a realistic fault model. By construction, our pro...

متن کامل

Formal verification of an implementation of CRT-RSA algorithm

Cryptosystems are highly sensitive to physical attacks, which leads security developers to design more and more complex countermeasures. Nonetheless, no proof of flaw absence has been given for any implementation of these countermeasures. This paper aims to formally verify an implementation of one published countermeasure against fault injection attacks. More precisely, the formal verification ...

متن کامل

Modified RSA Algorithm with CRT & OAEP

The most active subjects in the security related communities are the necessary protection against the data thieves. This gives an importance and the value of exchanged data over the Internet or other media types. In many RSA cryptosystems, we usually select a small value for the public key e. This kind of choice can only speed up the encryption operation but do not forget that by this way, the ...

متن کامل

A New Attack on RSA and CRT-RSA

In RSA, the public modulus N = pq is the product of two primes of the same bit-size, the public exponent e and the private exponent d satisfy ed ≡ 1 (mod (p−1)(q−1)). In many applications of RSA, d is chosen to be small. This was cryptanalyzed by Wiener in 1990 who showed that RSA is insecure if d < N. As an alternative, Quisquater and Couvreur proposed the CRT-RSA scheme in the decryption phas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Personal and Ubiquitous Computing

سال: 2021

ISSN: ['1617-4917', '1617-4909']

DOI: https://doi.org/10.1007/s00779-021-01607-3